Tree Based Energy and Congestion Aware Routing Protocol for Wireless Sensor Networks

نویسندگان

  • Amir Hossein Mohajerzadeh
  • Mohammad Hossein Yaghmaee Moghaddam
چکیده

Wireless Sensor Networks (WSNs) have inherent and unique characteristics rather than traditional networks. They have many different constraints, such as computational power, storage capacity, energy supply and etc; of course the most important issue is their energy constraint. Energy aware routing protocol is very important in WSN, but routing protocol which only considers energy has not efficient performance. Therefore considering other parameters beside energy efficiency is crucial for protocols efficiency. Depending on sensor network application, different parameters can be considered for its protocols. Congestion management can affect routing protocol performance. Congestion occurrence in network nodes leads to increasing packet loss and energy consumption. Another parameter which affects routing protocol efficiency is providing fairness in nodes energy consumption. When fairness is not considered in routing process, network will be partitioned very soon and then the network performance will be decreased. In this paper a Tree based Energy and Congestion Aware Routing Protocol (TECARP) is proposed. The proposed protocol is an energy efficient routing protocol which tries to manage congestion and to provide fairness in network. Simulation results shown in this paper imply that the TECARP has achieved its goals.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EEQR: An Energy Efficient Query-Based Routing Protocol for Wireless Sensor Networks

Routing in Wireless Sensor Networks (WSNs) is a very challenging task due to the large number of nodes, their mobility and lack of proper infrastructure. Since the sensors are battery powered devices, energy efficiency is considered as one of the main factors in designing routing protocols in WSNs. Most of energy-aware routing protocols are mere energy savers that attempt to decrease the energy...

متن کامل

EEQR: An Energy Efficient Query-Based Routing Protocol for Wireless Sensor Networks

Routing in Wireless Sensor Networks (WSNs) is a very challenging task due to the large number of nodes, their mobility and lack of proper infrastructure. Since the sensors are battery powered devices, energy efficiency is considered as one of the main factors in designing routing protocols in WSNs. Most of energy-aware routing protocols are mere energy savers that attempt to decrease the energy...

متن کامل

A fault tolerance routing protocol considering defined reliability and energy consumption in wireless sensor networks

In wireless sensor networks, optimal consumptionof energy and having maximum life time are important factors. In this article attempt has been made to send the data packets with particular reliability from the beginning based on AODV protocol. In this way two new fields add to the routing packets and during routing and discovering of new routes, the lowest remained energy of nodes and route tra...

متن کامل

Improving Energy Consumption by Using Cluster Based Routing Algorithm in Wireless Sensor Networks

Multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distributetraffic, as well as considerate fault tolerance. In this paper, a new clustering based multi path routingprotocol namely ECRR (Energy efficient Cluster based Routing algorithm for improving Reliability) isproposed, which is a new routing algorithm and guarantees the achievement to required QoS ...

متن کامل

A JOINT DUTY CYCLE SCHEDULING AND ENERGY AWARE ROUTING APPROACH BASED ON EVOLUTIONARY GAME FOR WIRELESS SENSOR NETWORKS

Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off ...

متن کامل

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Wireless Sensor Network

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2010